Metastability and the Furstenberg-Zimmer Tower II: Polynomial and Multidimensional Szemerédi’s Theorem
نویسنده
چکیده
The Furstenberg-Zimmer structure theorem for Z actions says that every measurepreserving system can be decomposed into a tower of primitive extensions. Furstenberg and Katznelson used this analysis to prove the multidimensional Szemerédi’s theorem, and Bergelson and Liebman further generalized to a polynomial Szemerédi’s theorem. Beleznay and Foreman showed that, in general, this tower can have any countable height. Here we show that these proofs do not require the full height of this tower; we define a weaker combinatorial property which is sufficient for these proofs, and show that it always holds at fairly low levels in the transfinite construction (specifically, ω ωω ).
منابع مشابه
Metastability in the Furstenberg-Zimmer Tower
According to the Furstenberg-Zimmer structure theorem, every measure-preserving system has a maximal distal factor, and is weak mixing relative to that factor. Furstenberg and Katznelson used this structural analysis of measure-preserving systems to provide a perspicuous proof of Szemerédi’s theorem. Beleznay and Foreman showed that, in general, the transfinite construction of the maximal dista...
متن کاملIdempotent Ultrafilters and Polynomial Recurrence
In the thirty or so years since H. Furstenberg reproved Szemerédi’s theorem using methods from ergodic theory, many striking discoveries have been made in the area now known as Ergodic Ramsey theory. Perhaps the most surprising of these is the discovery that recurrence results can be obtained for polynomial sets, meaning sets of values of polynomials. The following pretty theorem, a special cas...
متن کاملStationary Dynamical Systems
Following works of Furstenberg and Nevo and Zimmer we present an outline of a theory of stationary (or m-stationary) dynamical systems for a general acting group G equipped with a probability measure m. Our purpose is two-fold: First to suggest a more abstract line of development, including a simple structure theory. Second, to point out some interesting applications; one of these is a Szemeréd...
متن کاملSzemerédi’s Proof of Szemerédi’s Theorem
In 1975, Szemerédi famously established that any set of integers of positive upper density contained arbitrarily long arithmetic progressions. The proof was extremely intricate but elementary, with the main tools needed being the van der Waerden theorem and a lemma now known as the Szemerédi regularity lemma, together with a delicate analysis (based ultimately on double counting arguments) of l...
متن کاملCombinatorial Proofs of the Polynomial Van Der Waerden Theorem and the Polynomial Hales–jewett Theorem
The case with a single polynomial was proved by Furstenberg [3] and Sarkozy [5] (independently). It is easy to see that this generalises van der Waerden’s theorem, which we can recover by setting p i (x) ̄ ix for 1% i%m. Bergelson and Leibman also proved a stronger result. They showed that if AZ . has positive upper density, then there exist a and d such that all the points a and ap i (d ) are ...
متن کامل